Accelerated Subgradient Extragradient Algorithm for Solving Bilevel System of Equilibrium Problems

نویسندگان

چکیده

In this research paper, we propose a novel approach termed the inertial subgradient extragradient algorithm to solve bilevel system equilibrium problems within realm of real Hilbert spaces. Our is capable circumventing necessity for prior knowledge about Lipschitz constant involving bifunction and only computes minimization strong bifunctions onto feasible set that required. Under appropriate conditions, establish convergence theorems our proposed algorithms. To validate algorithms, illustrate series numerical examples. Through these examples, demonstrate performance algorithms have put forth in paper.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A modified subgradient extragradient method for solving monotone variational inequalities

In the setting of Hilbert space, a modified subgradient extragradient method is proposed for solving Lipschitz-continuous and monotone variational inequalities defined on a level set of a convex function. Our iterative process is relaxed and self-adaptive, that is, in each iteration, calculating two metric projections onto some half-spaces containing the domain is involved only and the step siz...

متن کامل

A hybrid subgradient algorithm for nonexpansive mappings and equilibrium problems

We propose a strongly convergent algorithm for finding a common point in the solution set of a class of pseudomonotone equilibrium problems and the set of fixed points of nonexpansive mappings in a real Hilbert space. The proposed algorithm uses only one projection and does not require any Lipschitz condition for the bifunctions. AMS 2010 Mathematics subject classification: 65 K10, 65 K15, 90 C...

متن کامل

An algorithm for solving a class of bilevel programming problems

We consider the bilevel programming problem with a special lower level. As a reformulation, we use the optimal value approach which will be the basis for an outer approximation. We establish an algorithm that sequentially improves the approximation in order to solve the bilevel programming problem. Convergence results for both local and global optima are presented.

متن کامل

An Algorithm for Solving Rule Sets-Based Bilevel Decision Problems

Bilevel decision addresses the problem in which two levels of decision makers, each tries to optimize their individual objectives under certain constraints, and to act and react in an uncooperative and sequential manner. Given the difficulty of formulating a bilevel decision problem by mathematical functions, a rule-sets based bilevel decision model was proposed. This paper presents an algorith...

متن کامل

The hybrid block iterative algorithm for solving the system of equilibrium problems and variational inequality problems

ABSTRACT In this paper, we construct the hybrid block iterative algorithm for finding a common element of the set of common fixed points of an infinite family of closed and uniformly quasi - ϕ- asymptotically nonexpansive mappings, the set of the solutions of the variational inequality for an α-inverse-strongly monotone operator, and the set of solutions of a system of equilibrium problems. Mor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2023

ISSN: ['0865-4824', '2226-1877']

DOI: https://doi.org/10.3390/sym15091681